Sensitivity Analysis of Uncertain Systems via Semidefinite Programming
نویسندگان
چکیده
منابع مشابه
Global Sensitivity Analysis of Biochemical Reaction Networks Via Semidefinite Programming
We study the problem of computing outer bounds for the region of steady states of biochemical reaction networks modelled by ordinary differential equations, with respect to parameters that are allowed to vary within a predefined region. Using a relaxed version of the corresponding feasibility problem and its Lagrangian dual, we show how to compute certificates for regions in state space not con...
متن کاملStructural Design via Semidefinite Programming
We consider a general problem of Structural Design and demonstrate that under mild assumptions it can be posed as a Semidefinite program. The approach in question allows for unified treatment of single-load/multi-load Truss and Shape design with and without obstacles, same as for obstacle-free robust Truss and Shape design. We present three equivalent Semidefinite formulations of the Structural...
متن کاملProduct Theorems Via Semidefinite Programming
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovász to determine the Shannon capacity of the pentagon; to show a direct sum theorem for non-deterministic communication complexity and direct product theorems for discrepancy; and in interactive proof systems to show parallel repetition theorems for res...
متن کاملLinear index coding via semidefinite programming
In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is k...
متن کاملRobust Truss Topology Design via Semidefinite Programming
We present and motivate a new model of the truss topology design problem, where the rigidity of the resulting truss with respect both to given loading scenarios and small “occasional” loads is optimized. It is shown that the resulting optimization problem is a semidefinite program. We derive and analyze several equivalent reformulations of the problem and present illustrative numerical examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1996
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.32.1212